The algebraic decoding of Goppa codes
نویسنده
چکیده
An interesting class of l inear error-correcting codes has been found by Goppa [3], [4]. This paper presents algebraic decoding algorithms for the Goppa codes. These algorithms are only a little more complex than Berlekamp’s well-known algorithm for BCH codes and, in fact, make essential use of his procedure. Hence the cost of decoding a Goppa code is similar to the cost of decoding a BCH code of comparable block length.
منابع مشابه
Goppa codes
Absfruct-Goppa described a new class of linear noncyclic errorcorrecting codes in [l] and [2]. This paper is a summary of Goppa’s work, which is not yet available in English.’ We prove the four most important properties of Goppa codes. 1) There exist q-ary Goppa codes with lengths and redundancies comparable to BCH codes. For the same redundancy, the Goppa code is typically one digit longer. 2)...
متن کاملOn GAG-Codes and Geometric Goppa Codes
We investigate a relation between generalized algebraic geometry codes and geometric Goppa codes. We also propose a decoding method for algebraic geometry codes.
متن کاملRank Two Bundles on Algebraic Curves and Decoding of Goppa Codes
We study a connection between two topics: Decoding of Goppa codes arising from an algebraic curve, and rank two extensions of certain line bundles on the curve. The material about each isolated topic is well known. Our contribution is just to expose a connection between them.
متن کاملEfficient Decoding Methods in Goppa codes based on Klein Curves
The use of Algebraic curves in coding theory provides a great deal of flexibility. The rate of encoding and decoding of codes depends greatly on its construction. In this research report we will establish the mathematical basis for coding theory, algebraic curves and encoding and decoding techniques which improve the performance of coding systems. We will also investigation two different Klein ...
متن کاملOn the efficient decoding of algebraic-geometric codes
This talk is intended to give a survey on the existing literature on the decoding of algebraic-geometric codes. Although the motivation originally was to find an efficient decoding algorithm for algebraic-geometric codes, the latest results give algorithms which can be explained purely in terms of linear algebra. We will treat the following subjects: 1. The decoding problem 2. Decoding by error...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 21 شماره
صفحات -
تاریخ انتشار 1975